Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound

We give an algorithm for constructing linear network error-correcting codes that achieve the Singleton bound for network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.

متن کامل

Construction X for quantum error-correcting codes

Construction X is known from the theory of classical error control codes. We present a variant of this construction that produces stabilizer quantum error control codes from arbitrary linear codes. Our construction does not require the classical linear code that is used as an ingredient to satisfy the dual containment condition. We prove lower bounds on the minimum distance of quantum codes obt...

متن کامل

On the Hamming bound for nonbinary localized-error-correcting codes

For nonbinary codes it is proved that the Hamming bound is asymptotically sharp in some range of the code rate.

متن کامل

Kolmogorov complexity and the asymptotic bound for error-correcting codes

The set of all error-correcting block codes over a fixed alphabet with q letters determines a recursively enumerable set of rational points in the unit square with coordinates (R, δ):= (relative transmission rate, relative minimal distance). Limit points of this set form a closed subset, defined by R ≤ αq(δ), where αq(δ) is a continuous decreasing function called the asymptotic bound. Its exist...

متن کامل

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes

Nhtsl kninvn clwwes of binory Crror.corrcctirlg cocks h:lvc Iwcn dcsiyrcd for usc on symnwtric ch:innels, i.e.. chonnels for which the error prob;lbilitit’s I ~ O snd O -+ I are cqu:il. IIowcvcr. in ccrlvin applications (e.g.. LSI memory protection (l{cf. I). optic:lt c~)lllttttltlic:llit>n (Ref. 6)). tlw observed errors :Irc highly :Isynlnwtric. and the uppropriistc ch:lntwl model moy in f:wl ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2007

ISSN: 0916-8508,1745-1337

DOI: 10.1093/ietfec/e90-a.9.1729